Multicast routing with end-to-end delay and delay variation constraints
نویسندگان
چکیده
منابع مشابه
Rouskas and Baldine: Multicast Routing with End-to-end Delay and Delay Variation Constraints
| We study the problem of constructing multi-cast trees to meet the quality of service requirements of real-time interactive applications operating in high-speed packet-switched environments. In particular, we assume that multicast communication depends on (a) bounded delay along the paths from the source to each destination, and (b) bounded variation among the delays along these paths. We rst ...
متن کاملMulticast Routing with End-to-End Delay and Delay Variation Constraints
We study the problem of constructing multicast trees to meet the quality of service requirements of real-time, interactive applications operating in high-speed packet-switched environments. In particular, we assume that multicast communication depends on (a) bounded delay along the paths from the source to each destination, and (b) bounded variation among the delays along these paths. We rst es...
متن کاملMulticast Routing with End-to-End Delay and Delay Variation Constraints - Selected Areas in Communications, IEEE Journal on
We study the problem of constructing multicast trees to meet the quality of service requirements of real-time interactive applications operating in high-speed packet-switched environments. In particular, we assume that multicast communication depends on: 1) bounded delay along the paths from the source to each destination and 2) bounded variation among the delays along these paths. We first est...
متن کاملImproved multicast routing with delay and delay variation constraints
Multi point Routing algorithms capable of satisfying Quality of Service constraints such as Delay Bounded-ness and Delay Variation Bounded-ness are becoming crucial with the advent of high speed networks. This paper addresses the problem of determining minimum cost paths to nodes in a Multicast group satisfying delay bounds and delay variation bounds. A routing protocol is proposed and compared...
متن کاملOn Routing Algorithms with End-to-End Delay Guarantees
We consider the transmission of a message of size r from a source to a destination over a computer network with n nodes and m links. There are three sources of delays: (a) propagation delays along the links, (b) delays due to bandwidth availability on the links, and (c) queuing delays at the intermediate nodes. First, we consider that the delays on various links and nodes are given as functions...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Journal on Selected Areas in Communications
سال: 1997
ISSN: 0733-8716
DOI: 10.1109/49.564133